Genetic Programming without Fitness
نویسنده
چکیده
This paper provides a short, informal illustration of a selection scheme based on the key idea of competition, particularly suited for genetic programming, which provides a way to do without the explicit deenition of a tness function. In many tasks, competition between two individuals on one problem instance chosen according to some probability can be a valid alternative to deening an appropriate tness function that includes a priori knowledge of the problem, which requires insights on the problem along with some mathematical skills.
منابع مشابه
Dimensionality Reduction and Improving the Performance of Automatic Modulation Classification using Genetic Programming (RESEARCH NOTE)
This paper shows how we can make advantage of using genetic programming in selection of suitable features for automatic modulation recognition. Automatic modulation recognition is one of the essential components of modern receivers. In this regard, selection of suitable features may significantly affect the performance of the process. Simulations were conducted with 5db and 10db SNRs. Test and ...
متن کاملFitness Clouds and Problem Hardness in Genetic Programming
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative slope coefficient, based on the concept of fitness cloud. The negative slope coefficient is a predictive measure, i.e. it can be calculated without prior knowledge of the global optima. The fitness cloud is generated v...
متن کاملA Genetic Programming-based trust model for P2P Networks
Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...
متن کاملGenetic Programming on Program Traces as an Inference Engine for Probabilistic Languages
Methods of simulated annealing and genetic programming over probabilistic program traces are developed firstly. These methods combine expressiveness of Turing-complete probabilistic languages, in which arbitrary generative models can be defined, and search effectiveness of meta-heuristic methods. To use these methods, one should only specify a generative model of objects of interest and a fitne...
متن کاملInfluences of Function Sets in Genetic Programming
Genetic programming (GP) provides a good tool for solving sequence induction and symbolic regression (i.e. function identification) problems. However, the influence of the function set in these problems has not been extensively studied. In this paper, I compare the efficiency of six function sets, using GP to find the numerical approximation of a number sequence and symbolic regressions of func...
متن کاملFitness Causes Bloat
The problem of evolving an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Known variously as “bloat”, “fluff” and increasing “structural complexity”, this is often described in terms of increasing “redundancy” in the code caused by “introns”. Comparison between runs with and without fitness selection pressure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996